On Hoare-McCarthy algebras
نویسندگان
چکیده
We discuss an algebraic approach to propositional logic with side effects. To this end, we use Hoare’s conditional [1985], which is a ternary connective comparable to if-then-else. Starting from McCarthy’s notion of sequential evaluation [1963] we discuss a number of valuation congruences and we introduce Hoare-McCarthy algebras as the structures that characterize these congruences.
منابع مشابه
Program Algebras with Monotone Floyd-Hoare Composition
In the paper special program algebras of partial predicates and functions are described. Such algebras form a semantic component of a modified Floyd-Hoare logic constructed on the base of a composition-nominative approach. According to this approach, Floyd-Hoare assertions are presented with the help of a special composition called Floyd-Hoare composition. Monotonicity and continuity of this co...
متن کاملOn the Expressive Power of Kleene Algebra with Domain
It is shown that antidomain semirings are more expressive than test semirings and that Kleene algebras with domain are more expressive than Kleene algebras with tests. It is also shown that Kleene algebras with domain are expressive for propositional Hoare logic whereas Kleene algebras with tests are not.
متن کاملAbstract hoare logic
Hoare Logic Abstract Hoare LogicHoare Logic Paulo Oliva (joint work with U. Martin and E. A. Mathiesen) Queen Mary, University of London, UK ([email protected]) TMC, Network Algebras, and Applications Wroc law, 15 July 2007 Abstract Hoare LogicHoare Logic
متن کاملProposition Algebra and Short-Circuit Logic
Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is only evaluated if the first argument does not suffice to determine the value of the expression. In programming, short-circuit evaluation is widely used. We review proposition algebra [2010], an algebraic approach to propositional logic with side effects that models short-circuit evaluatio...
متن کاملFeasibly Reducing KAT Equations to KA Equations
Kleene algebra (KA) is the algebra of regular events. Familiar examples of Kleene algebras include regular sets, relational algebras, and trace algebras. A Kleene algebra with tests (KAT) is a Kleene algebra with an embedded Boolean subalgebra. The addition of tests allows one to encode while programs as KAT terms, thus the equational theory of KAT can express (propositional) program equivalenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1012.5059 شماره
صفحات -
تاریخ انتشار 2010